Vaught ’ s Never Two Theorem Bachelor

نویسنده

  • Michael Zechner
چکیده

This bachelor thesis provides a short overview of some major results in model theory concerning the spectrum function I(T, κ), where T is a firstorder theory and κ is a cardinal. In short, I(T, κ) tells us how many models of cardinality κ T has up to isomorphism. After summarising some basic definitions and results of elementary predicate logic, we turn our attention to types, both from a model theoretic, a topological and an algebraic perspective. The notions of ω-saturated, atomic and ω-categorical models are discussed in detail and needed in order to prove Robert L. Vaught’s Never Two Theorem which states that I(T,א0) 6= 2, when T is a complete theory with infinite models of a countable first-order language.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic uses of the Feferman-Vaught Theorem

The classical Feferman–Vaught Theorem for First Order Logic explains how to compute the truth value of a 5rst order sentence in a generalized product of 5rst order structures by reducing this computation to the computation of truth values of other 5rst order sentences in the factors and evaluation of a monadic second order sentence in the index structure. This technique was later extended by L8...

متن کامل

Polish Group Actions: Dichotomies and Generalized Elementary Embeddings

The results in this paper involve two different topics in the descriptive theory of Polish group actions. The book Becker-Kechris [6] is an introduction to that theory. Our two topics—and two collections of theorems—are rather unrelated, but the proofs for both topics are essentially the same. Locally compact Polish groups, i.e., second countable locally compact groups, are the traditional obje...

متن کامل

Logics of Finite Hankel Rank

We discuss the Feferman-Vaught Theorem in the setting of abstract model theory for finite structures. We look at sum-like and product-like binary operations on finite structures and their Hankel matrices. We show the connection between Hankel matrices and the FefermanVaught Theorem. The largest logic known to satisfy a Feferman-Vaught Theorem for product-like operations is CFOL, first order log...

متن کامل

The Vaught Conjecture: Do Uncountable Models Count?

We give a model theoretic proof, replacing admisssible set theory by the LopezEscobar theorem, of Makkai’s theorem: Every counterexample to Vaught’s conjecture has an uncountable model which realizes only countably many Lω1,ω-types. The following two results are new. Theorem I. If a first order theory is a counterexample to the Vaught conjecture then it has 2א1 models of cardinality א1. Theorem...

متن کامل

A Note on the Two Cardinal Problem

In this note we prove a theorem concerning the two cardinal problem (see [l], [4], [6], [7] for reference and for some of the standard notation); this result has been referred to in [6, p. 311] and [7, (3.7) ]. The problem, first proposed by Vaught, is as follows. Let T be a first-order theory and let U be a unary predicate symbol in the language of T. T is said to admit the pair a, ß of cardin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017